On Pseudo - Random Arrays *

An arrays of O's and l's has the u v horizontal window property if every nonzero view is seen once when a u v window is moved horizontally across the array. We study the problem of constructing an array which, for a given m, has the u x v horizontal window property for all factorizations rn uv. Using maximal linear shift register sequences for the rows we are able to construct such arrays of size m (2" 1) for various values of m, including all m =< 34 and m p or p2 where p is prime. Similarly we construct arrays of size (2" 1) (2 1) which have both the u v horizontal window property and the u v vertical window property for all factorizations m uv.